A two-grids/projection algorithm for obstacle problems
نویسندگان
چکیده
منابع مشابه
A Two-Grids/Projection Algorithm for Obstacle Problems
In order to emphasize the possible relation between discontinuous and continuous approximations on different meshes, a two-grids method for the resolution of parabolic variational inequality problems is presented. The numerical methodology combines a time splitting algorithm to decouple a diffusion phenomenon from an obstacle problem. The diffusion problem is solved by using finite differences,...
متن کاملMultilevel Projection Algorithm for Solving Obstacle Problems
K e y w o r d s O b s t a c l e problem, Multilevel projection, Convergence, Finite element, Error estimate. 1 . I N T R O D U C T I O N The obstacle problem we consider here can be described as follows: find the equilibrium position u = u(x), x E f~ C R 2 of an elastic membrane constrained to lie above a given obstacle @ = @(x) under an external force f (x ) . Then u(x) is the formal solution ...
متن کاملAn Algorithm for Two Dimensional Cutting Stock Problems with Demand
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
متن کاملAn Algorithm for Two Dimensional Cutting Stock Problems with Demand
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
متن کاملAn algorithm for solving the double obstacle problems
In this paper, we extend the algorithm in Xue and Cheng [L. Xue, X.L. Cheng, An algorithm for solving the obstacle problems, Comput. Math. Appl. 48 (2004) 1651–1657] for solving the double obstacle problem. We try to find the approximated region of the contact in the double obstacle problem with less computation time by iteration. Numerical example is given for the double obstacle problem for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2005
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2004.11.016